for _ in range(int(input())):
x,y,z=map(int,input().split())
l=[x,y,z]
l.sort();
if(l[1]!=l[2]):
print("NO")
else:
print("YES")
print(min([x,y,z]),min([x,y,z]),max([x,y,z]))
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t,x,y,z,a,b,c;
cin >> t;
while(t--)
{
int a[3];
cin >> a[1] >> a[2] >> a[3];
sort(a + 1, a + 3 + 1);
if(a[1] == a[2] && a[1] == a[3])
{
cout << "YES" <<endl;
cout << a[1] << ' ' << a[2] << ' ' << a[3] << endl;
}
else if(a[2] == a[3])
{
cout << "YES" <<endl;
cout << 1 << ' ' << a[1] << ' ' << a[3] << endl;
}
else cout << "NO" << endl;
}
return 0;
}
1478B - Nezzar and Lucky Number | 228A - Is your horseshoe on the other hoof |
122A - Lucky Division | 1611C - Polycarp Recovers the Permutation |
432A - Choosing Teams | 758A - Holiday Of Equality |
1650C - Weight of the System of Nested Segments | 1097A - Gennady and a Card Game |
248A - Cupboards | 1641A - Great Sequence |
1537A - Arithmetic Array | 1370A - Maximum GCD |
149A - Business trip | 34A - Reconnaissance 2 |
59A - Word | 462B - Appleman and Card Game |
1560C - Infinity Table | 1605C - Dominant Character |
1399A - Remove Smallest | 208A - Dubstep |
1581A - CQXYM Count Permutations | 337A - Puzzles |
495A - Digital Counter | 796A - Buying A House |
67A - Partial Teacher | 116A - Tram |
1472B - Fair Division | 1281C - Cut and Paste |
141A - Amusing Joke | 112A - Petya and Strings |